Wormhole Routing Simulation on a Mesh

We present here a series of experimental results for several implementations of online, oblivious wormhole routing on a mesh-connected processor network, using one bend paths. Theoretical studies so far were able to prove that the running time for such algorithms is O(L p N log(N)) .Our experimental results connrm that there exists a linear dependence between the time (average and maximum) required for any message to reach its destination and the length L of each message. On the other hand, for certain implementations the total running time seems to be almost linear in the size of the network. Finally, we study how the buuering capability of the intermediate nodes aaects the running time of the implemented algorithms.